239B - Easy Tape Programming - CodeForces Solution

#include <bits/stdc++.h>

void solve(std::string s, int n){ 
    int CP = 0;
    int DP = 1;
    std::vector <int> ans(10, 0);
    std::vector <bool> met(n, false);
    while (1) {
        if (s[CP] != '<' && s[CP]!='>') {
            ans[s[CP]-'0']++;
            if (s[CP] != '0') s[CP]--;
            else met[CP] = true;
            CP += DP;
            while (CP>=0 && CP<n && met[CP]) CP += DP;
            if (CP<0 || CP>=n) break;
        }
        else {
            if (s[CP]=='>') DP = 1;
            else DP = -1;
            int pos = CP;
            CP += DP;
            while (CP>=0 && CP<n && met[CP]) CP += DP;
            if (CP<0 || CP>=n) break;
            if (s[CP]=='>' || s[CP]=='<') met[pos] = true;
        }
    }

    for (int i = 0;i<10;i++)
        std::cout << ans[i] << " ";
    std::cout << "\n";
}

int main() {
    int n, q;
    std::cin >> n >> q;
    std::string s;
    std::cin >> s;
    while (q--) {
        int l, r;
        std::cin >> l >> r;
        solve(s.substr(l-1, r-l+1), r-l+1);
    }
    return 0;
}/*1690616271.7140307*/